New Results on Vector and Homing Vector Automata

Homing vector automata

We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept the input. The computational power of the deterministic, nondeterministic and blind versions of these realtime machines are examined and compared to various ...

Common fixed point results on vector metric spaces

In this paper we consider the so called a vector metric space, which is a generalization of metric space, where the metric is Riesz space valued. We prove some common fixed point theorems for three mappings in this space. Obtained results extend and generalize well-known comparable results in the literature.

Some Results on p-Best Approximation in Vector Spaces

Vector team automata

Vector team automata are team automata with an explicit representation of synchronizations. This makes a translation possible of a subclass of vector team automata into individual token net controllers, a model of labeled Petri nets developed within the framework of vector controlled concurrent systems. © 2011 Elsevier B.V. All rights reserved.

Implicit Real Vector Automata

This thesis introduces a new data structure, the Implicit Real Vector Automaton (IRVA), suited for representing symbolically polyhedra, i.e., regions of n-dimensional space defined by finite Boolean combinations of linear inequalities. IRVA can represent exactly arbitrary convex and non-convex polyhedra, including features such as open and closed boundaries, unconnected parts, and non-manifold ...